Least-square solutions for inverse problems of centrosymmetric matrices
نویسندگان
چکیده
منابع مشابه
Inverse eigenproblem for centrosymmetric and centroskew matrices and their approximation
In this paper, we first give the solvability condition for the following inverse eigenproblem (IEP): given a set of vectors {xi}i=1 in Cn and a set of complex numbers {λi}i=1, find a centrosymmetric or centroskew matrix C in Rn×n such that {xi}i=1 and {λi}i=1 are the eigenvectors and eigenvalues of C respectively. We then consider the best approximation problem for the IEPs that are solvable. M...
متن کاملThe Inverse Problem of Centrosymmetric Matrices with a Submatrix Constraint
By using Moore-Penrose generalized inverse and the general singular value decomposition of matrices, this paper establishes the necessary and sufficient conditions for the existence of and the expressions for the centrosymmetric solutions with a submatrix constraint of matrix inverse problem AX = B. In addition, in the solution set of corresponding problem, the expression of the optimal approxi...
متن کاملcollocation discrete least square (cdls) method for elasticity problems
a meshless approach, collocation discrete least square (cdls) method, is extended in this paper, for solvingelasticity problems. in the present cdls method, the problem domain is discretized by distributed field nodes. the fieldnodes are used to construct the trial functions. the moving least-squares interpolant is employed to construct the trialfunctions. some collocation points that are indep...
متن کاملOn Mixed and Componentwise Condition Numbers for Moore-Penrose Inverse and Linear Least Square Problems
In this talk, we discuss the maximum number of n × n pure imaginary quaternionic solutions to the Hurwitz matrix equations given by T i T * j + T j T Abstract Let T be a bounded linear operator on a complex Hilbert space H. For 0 ≤ q ≤ 1, the
متن کاملA Distributed Algorithm for Least Square Solutions of Linear Equations
A distributed discrete-time algorithm is proposed for multi-agent networks to achieve a common least squares solution of a group of linear equations, in which each agent only knows some of the equations and is only able to receive information from its nearby neighbors. For fixed, connected, and undirected networks, the proposed discrete-time algorithm results in each agents solution estimate to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2003
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(03)00137-8